Dubins ’ Problem on Surfaces . I . Nonnegative Curvature
نویسندگان
چکیده
Let M be a complete, connected, two-dimensional Riemannian manifold. Consider the following question: Given any (p1, v1) and (p2, v2) in T M , is it possible to connect p1 to p2 by a curve γ in M with arbitrary small geodesic curvature such that, for i = 1, 2, γ̇ is equal to vi at pi? In this article, we bring a positive answer to the question if M verifies one of the following three conditions: (a) M is compact, (b) M is asymptotically flat, and (c) M has bounded nonnegative curvature outside a compact subset.
منابع مشابه
Dubins' Problem on Surfaces II: Nonpositive Curvature
Let M be a complete, connected, two-dimensional Riemannian manifold with nonpositive Gaussian curvature K. We say that M satisfies the unrestricted complete controllability (UCC) property for the Dubins problem if the following holds: given any (p1, v1) and (p2, v2) in TM , there exists, for every ε > 0, a curve γ in M , with geodesic curvature smaller than ε, such that γ connects p1 to p2 and,...
متن کاملDiscrete Dubins Paths
A Dubins path is a shortest path with bounded curvature. The seminal result in nonholonomic motion planning is that (in the absence of obstacles) a Dubins path consists either from a circular arc followed by a segment followed by another arc, or from three circular arcs [Dubins, 1957]. Dubins original proof uses advanced calculus; later, Dubins result was reproved using control theory technique...
متن کاملOn Polygonal Paths with Bounded Discrete-Curvature: The Inflection-Free Case
A shortest path joining two specified endpoint configurations that is constrained to have mean curvature at most ς on every non-zero length sub-path is called a ς-geodesic. A seminal result in non-holonomic motion planning is that (in the absence of obstacles) a 1-geodesic consists of either (i) a (unit-radius) circular arc followed by a straight segment followed by another circular arc, or (ii...
متن کاملShortest Paths of Bounded Curvature for the Dubins Interval Problem
The Dubins interval problem aims to find the shortest path of bounded curvature between two targets such that the departure angle from the first target and the arrival angle at the second target are constrained to two respective intervals. We propose a new and a simple algorithm to this problem based on the minimum principle of Pontryagin.
متن کاملAsymptotic constant-factor approximation algorithm for the Traveling Salesperson Problem for Dubins' vehicle
This article proposes the first known algorithm that achieves a constant-factor approximation of the minimum length tour for a Dubins’ vehicle through n points on the plane. By Dubins’ vehicle, we mean a vehicle constrained to move at constant speed along paths with bounded curvature without reversing direction. For this version of the classic Traveling Salesperson Problem, our algorithm closes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014